Manipulation of optimal matchings via predonation of endowment

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Manipulation of Optimal Matchings via Predonation of Endowment ∗ July 2003

In this paper we answer a question posed by Sertel and Özkal-Sanver (2002) on the manipulability of optimal matching rules in matching problems with endowments. We characterize the classes of consumption rules under which optimal matching rules can be manipulated via predonation of endowment.

متن کامل

Manipulation of optimal matchings via predonation of endowment

In this paper we answer a question posed by Sertel and Özkal-Sanver (2002) on the manipulability of optimal matching rules in matching problems with endowments. We characterize the classes of consumption rules under which optimal matching rules can be manipulated via predonation of endowment.

متن کامل

new semigroup compactifications via the enveloping semigroups of associated flows

this thesis deals with the construction of some function algebras whose corresponding semigroup compactification are universal with respect to some properies of their enveloping semigroups. the special properties are of beigan a left zero, a left simple, a group, an inflation of the right zero, and an inflation of the rectangular band.

15 صفحه اول

Manipulation of Loss Aversion by Changes in Endowment and Affect :

Institutions: Institute of Medical Psychology and Behavioral Neurobiology; University of Tübingen, Tübingen, Germany, Institute of Medical Psychology and Behavioural Neurobiology, University of Tuebingen, Tuebingen, Germany, Institute of Medical Psychology and Behavioral Neurobiology, University of Tuebingen, Tuebingen, Germany, Centre of Behavioural and Cognitive Sciences, University of Allaha...

متن کامل

Optimal popular matchings

In this paper we consider the problem of computing an ‘‘optimal’’ popular matching. We assume that our input instance G = (A∪P , E1 ∪̇ · · · ∪̇ Er ) admits a popular matching and here we are asked to return not any popular matching but an optimal popular matching, where the definition of optimality is given as a part of the problem statement; for instance, optimality could be fairness inwhich cas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Social Sciences

سال: 2004

ISSN: 0165-4896

DOI: 10.1016/j.mathsocsci.2003.09.002